--- title: "L1-055 谁是赢家" created: 2025-11-28 tags: - 算法 --- # L1-055 谁是赢家 ## 题目 [L1-055 谁是赢家](https://pintia.cn/problem-sets/994805046380707840/exam/problems/type/7?problemSetProblemId=994805075543703552&page=0) ![[image-bf12019c.png]] ## 思路分析 ## 代码实现 ```cpp #include using namespace std; #define endl '\n' using ll = long long; using ull = unsigned long long; using PII = pair; using Pll = pair; int dx[4]={-1,0,1,0},dy[4]={0,1,0,-1}; const int inf = 0x3f3f3f3f; int main(){ ios::sync_with_stdio(0),cin.tie(0),cout.tie(0); int pa,pb;cin>>pa>>pb; int za=0,zb=0; for(int i=0;i<3;i++){ int pw;cin>>pw; if(pw==0) za++; else zb++; } if(pa>pb && za>=1){ cout<<"The winner is a: "<pa && zb>=1){ cout<<"The winner is b: "<